Termination w.r.t. Q of the following Term Rewriting System could be proven:

Q restricted rewrite system:
The TRS R consists of the following rules:

pred1(s1(x)) -> x
minus2(x, 0) -> x
minus2(x, s1(y)) -> pred1(minus2(x, y))
quot2(0, s1(y)) -> 0
quot2(s1(x), s1(y)) -> s1(quot2(minus2(x, y), s1(y)))
log1(s1(0)) -> 0
log1(s1(s1(x))) -> s1(log1(s1(quot2(x, s1(s1(0))))))

Q is empty.


↳ QTRS
  ↳ DependencyPairsProof

Q restricted rewrite system:
The TRS R consists of the following rules:

pred1(s1(x)) -> x
minus2(x, 0) -> x
minus2(x, s1(y)) -> pred1(minus2(x, y))
quot2(0, s1(y)) -> 0
quot2(s1(x), s1(y)) -> s1(quot2(minus2(x, y), s1(y)))
log1(s1(0)) -> 0
log1(s1(s1(x))) -> s1(log1(s1(quot2(x, s1(s1(0))))))

Q is empty.

Using Dependency Pairs [1,13] we result in the following initial DP problem:
Q DP problem:
The TRS P consists of the following rules:

QUOT2(s1(x), s1(y)) -> QUOT2(minus2(x, y), s1(y))
MINUS2(x, s1(y)) -> PRED1(minus2(x, y))
LOG1(s1(s1(x))) -> QUOT2(x, s1(s1(0)))
LOG1(s1(s1(x))) -> LOG1(s1(quot2(x, s1(s1(0)))))
QUOT2(s1(x), s1(y)) -> MINUS2(x, y)
MINUS2(x, s1(y)) -> MINUS2(x, y)

The TRS R consists of the following rules:

pred1(s1(x)) -> x
minus2(x, 0) -> x
minus2(x, s1(y)) -> pred1(minus2(x, y))
quot2(0, s1(y)) -> 0
quot2(s1(x), s1(y)) -> s1(quot2(minus2(x, y), s1(y)))
log1(s1(0)) -> 0
log1(s1(s1(x))) -> s1(log1(s1(quot2(x, s1(s1(0))))))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.

↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof

Q DP problem:
The TRS P consists of the following rules:

QUOT2(s1(x), s1(y)) -> QUOT2(minus2(x, y), s1(y))
MINUS2(x, s1(y)) -> PRED1(minus2(x, y))
LOG1(s1(s1(x))) -> QUOT2(x, s1(s1(0)))
LOG1(s1(s1(x))) -> LOG1(s1(quot2(x, s1(s1(0)))))
QUOT2(s1(x), s1(y)) -> MINUS2(x, y)
MINUS2(x, s1(y)) -> MINUS2(x, y)

The TRS R consists of the following rules:

pred1(s1(x)) -> x
minus2(x, 0) -> x
minus2(x, s1(y)) -> pred1(minus2(x, y))
quot2(0, s1(y)) -> 0
quot2(s1(x), s1(y)) -> s1(quot2(minus2(x, y), s1(y)))
log1(s1(0)) -> 0
log1(s1(s1(x))) -> s1(log1(s1(quot2(x, s1(s1(0))))))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The approximation of the Dependency Graph [13,14,18] contains 3 SCCs with 3 less nodes.

↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ AND
          ↳ QDP
            ↳ QDPOrderProof
          ↳ QDP
          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

MINUS2(x, s1(y)) -> MINUS2(x, y)

The TRS R consists of the following rules:

pred1(s1(x)) -> x
minus2(x, 0) -> x
minus2(x, s1(y)) -> pred1(minus2(x, y))
quot2(0, s1(y)) -> 0
quot2(s1(x), s1(y)) -> s1(quot2(minus2(x, y), s1(y)))
log1(s1(0)) -> 0
log1(s1(s1(x))) -> s1(log1(s1(quot2(x, s1(s1(0))))))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].


The following pairs can be oriented strictly and are deleted.


MINUS2(x, s1(y)) -> MINUS2(x, y)
The remaining pairs can at least be oriented weakly.
none
Used ordering: Polynomial interpretation [21]:

POL(MINUS2(x1, x2)) = 2·x2   
POL(s1(x1)) = 1 + 2·x1   

The following usable rules [14] were oriented: none



↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ AND
          ↳ QDP
            ↳ QDPOrderProof
              ↳ QDP
                ↳ PisEmptyProof
          ↳ QDP
          ↳ QDP

Q DP problem:
P is empty.
The TRS R consists of the following rules:

pred1(s1(x)) -> x
minus2(x, 0) -> x
minus2(x, s1(y)) -> pred1(minus2(x, y))
quot2(0, s1(y)) -> 0
quot2(s1(x), s1(y)) -> s1(quot2(minus2(x, y), s1(y)))
log1(s1(0)) -> 0
log1(s1(s1(x))) -> s1(log1(s1(quot2(x, s1(s1(0))))))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The TRS P is empty. Hence, there is no (P,Q,R) chain.

↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ AND
          ↳ QDP
          ↳ QDP
            ↳ QDPOrderProof
          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

QUOT2(s1(x), s1(y)) -> QUOT2(minus2(x, y), s1(y))

The TRS R consists of the following rules:

pred1(s1(x)) -> x
minus2(x, 0) -> x
minus2(x, s1(y)) -> pred1(minus2(x, y))
quot2(0, s1(y)) -> 0
quot2(s1(x), s1(y)) -> s1(quot2(minus2(x, y), s1(y)))
log1(s1(0)) -> 0
log1(s1(s1(x))) -> s1(log1(s1(quot2(x, s1(s1(0))))))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].


The following pairs can be oriented strictly and are deleted.


QUOT2(s1(x), s1(y)) -> QUOT2(minus2(x, y), s1(y))
The remaining pairs can at least be oriented weakly.
none
Used ordering: Polynomial interpretation [21]:

POL(0) = 0   
POL(QUOT2(x1, x2)) = x1   
POL(minus2(x1, x2)) = x1   
POL(pred1(x1)) = x1   
POL(s1(x1)) = 1 + 2·x1   

The following usable rules [14] were oriented:

minus2(x, s1(y)) -> pred1(minus2(x, y))
pred1(s1(x)) -> x
minus2(x, 0) -> x



↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ AND
          ↳ QDP
          ↳ QDP
            ↳ QDPOrderProof
              ↳ QDP
                ↳ PisEmptyProof
          ↳ QDP

Q DP problem:
P is empty.
The TRS R consists of the following rules:

pred1(s1(x)) -> x
minus2(x, 0) -> x
minus2(x, s1(y)) -> pred1(minus2(x, y))
quot2(0, s1(y)) -> 0
quot2(s1(x), s1(y)) -> s1(quot2(minus2(x, y), s1(y)))
log1(s1(0)) -> 0
log1(s1(s1(x))) -> s1(log1(s1(quot2(x, s1(s1(0))))))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The TRS P is empty. Hence, there is no (P,Q,R) chain.

↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ AND
          ↳ QDP
          ↳ QDP
          ↳ QDP
            ↳ QDPOrderProof

Q DP problem:
The TRS P consists of the following rules:

LOG1(s1(s1(x))) -> LOG1(s1(quot2(x, s1(s1(0)))))

The TRS R consists of the following rules:

pred1(s1(x)) -> x
minus2(x, 0) -> x
minus2(x, s1(y)) -> pred1(minus2(x, y))
quot2(0, s1(y)) -> 0
quot2(s1(x), s1(y)) -> s1(quot2(minus2(x, y), s1(y)))
log1(s1(0)) -> 0
log1(s1(s1(x))) -> s1(log1(s1(quot2(x, s1(s1(0))))))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].


The following pairs can be oriented strictly and are deleted.


LOG1(s1(s1(x))) -> LOG1(s1(quot2(x, s1(s1(0)))))
The remaining pairs can at least be oriented weakly.
none
Used ordering: Polynomial interpretation [21]:

POL(0) = 2   
POL(LOG1(x1)) = x1   
POL(minus2(x1, x2)) = x1   
POL(pred1(x1)) = x1   
POL(quot2(x1, x2)) = x1   
POL(s1(x1)) = 1 + 2·x1   

The following usable rules [14] were oriented:

minus2(x, s1(y)) -> pred1(minus2(x, y))
pred1(s1(x)) -> x
quot2(s1(x), s1(y)) -> s1(quot2(minus2(x, y), s1(y)))
quot2(0, s1(y)) -> 0
minus2(x, 0) -> x



↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ AND
          ↳ QDP
          ↳ QDP
          ↳ QDP
            ↳ QDPOrderProof
              ↳ QDP
                ↳ PisEmptyProof

Q DP problem:
P is empty.
The TRS R consists of the following rules:

pred1(s1(x)) -> x
minus2(x, 0) -> x
minus2(x, s1(y)) -> pred1(minus2(x, y))
quot2(0, s1(y)) -> 0
quot2(s1(x), s1(y)) -> s1(quot2(minus2(x, y), s1(y)))
log1(s1(0)) -> 0
log1(s1(s1(x))) -> s1(log1(s1(quot2(x, s1(s1(0))))))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The TRS P is empty. Hence, there is no (P,Q,R) chain.